Inferring Reduced Ordered Decision Graphs of Minimum Description Length
نویسندگان
چکیده
We propose an heuristic algorithm that induces decision graphs from training sets using Rissanen's minimum description length principle to control the tradeoo between accuracy in the training set and complexity of the hypothesis description.
منابع مشابه
Decision Graphs of Minimal Description Length
We propose an algorithm for the inference of decision graphs from a set of labeled instances. In particular, we propose to infer decision graphs where the variables can only be tested in accordance with a given order and no redundant nodes exist. This type of graphs, reduced ordered decision graphs, can be used as canonical representations of Boolean functions and can be manipulated using algor...
متن کاملInferring Reduced Ordered Decision Graphs of Minimal Description Length
The induction of decision trees from labeled training set data [BFOS84, BFOS84, Qui86, QR89] has been a successful approach for the induction of classification rules. However, although decision trees can, in principle, represent any concept, they are not concise representations for some concepts of interest. In particular, the quality of the generalization performed by a decision tree induced f...
متن کاملInferring Decision Trees Using the Minimum Description Length Principle
This paper concerns methods for inferring decision trees from examples for classification problems. The reader who is unfamiliar with this problem may wish to consult J. R. Quinlan’s paper (1986), or the excellent monograph by Breiman et al. (1984), although this paper will be self-contained. This work is inspired by Rissanen’s work on the Minimum description length principle (or MDLP for short...
متن کاملInferring Informed Clustering Problems with Minimum Description Length Principle
...............................................................................................................................iii Acknowledgements.............................................................................................................. iv Table of
متن کاملMinimum Degree Conditions for Cycles Including Specified Sets of Vertices
This paper generalises the concept of vertex pancyclic graphs. We define a graph as set-pancyclic if for every set S of vertices there is a cycle of every possible length containing S. We show that if the minimum degree of a graph exceeds half its order then the graph is set-pancyclic. We define a graph as k-ordered-pancyclic if, for every set S of cardinality k and every cyclic ordering of S, ...
متن کامل